Self-Affine Sets and Graph-Directed Systems

   Abstract. A self-affine set in R ⁿ is a compact set T with A(T)= ∪ _{d∈ D} (T+d) where A is an expanding n× n matrix with integer entries and D ={d ₁ , d ₂ ,···, d _N } ⊂ Z ⁿ is an N -digit set. For the case N = | det(A)| the set T has been studied in great detail in the context of self-affine tiles. Our main interest in this paper is to consider the case N > | det(A)| , but the theorems and proofs apply to all the N . The self-affine sets arise naturally in fractal geometry and, moreover, they are the support of the scaling functions in wavelet theory. The main difficulty in studying such sets is that the pieces T+d, d∈ D, overlap and it is harder to trace the iteration. For this we construct a new graph-directed system to determine whether such a set T will have a nonvoid interior, and to use the system to calculate the dimension of T or its boundary (if T ^o ≠  ). By using this setup we also show that the Lebesgue measure of such T is a rational number, in contrast to the case where, for a self-affine tile, it is an integer.     

一种计算工作时间参数新方法

为了编制和优化施工进度计划,计算构成施工项目的各项工作最早开始时间、最迟开始时间、最早完成时间、最迟完成时间、总时差和自由时差等时间参数十分重要.提出了一种计算工作时间参数新方法.该方法以工作完成时间为决策变量,通过建立和求解线性规划模型来得到各种工作时间参数.其建模思路清晰,不需绘制网络图,能用通用办公软件EXCEL求解.模拟计算表明,用该方法与用标准网络计划技术计算出的工作时间参数完全一致.     

《数学实验》课程建设的认识与实践

我们认为 :数学实验 ,就是对数学进行折腾 .我们提出一些饶有趣味而又有深刻背景的问题 ,让学生尝试自己去解决 ,借助于计算机 ,自己动手去折腾 ,在折腾过程中学习 ,观察现象和结果 ,猜测和验证规律 ,尝试和体验数学的探索、发现和应用     

Advanced basis construction in linear programming

This paper considers basis construction in a linear program when the number of activities with basic status is not equal to the number of rows in the particular scenario. This arises when starting with an ‘advanced basis’, obtained from a solution to another scenario. The goal here is to provide a triangular-seeking algorithm that takes advantage of structural properties during the construction of a basis agenda. For completeness, some facts, which are known but have not been published, are given about choosing an advanced basis and about spikes.     

杭州城市建设用地扩张的时空演变分析

基于杭州市1914—2018年间6期近代地图与遥感影像数据,通过目视解译数字化的近代地图,使用面向对象的分类方式对CORONA、Landsat TM和OLI影像进行分类并提取建设用地数据,计算扩张速度、重心变化、景观格局指数和增长类型,分析建设用地的扩张过程与扩张模式。结果表明：（1）近百年来杭州城市建设用地扩张明显,扩张过程主要集中在改革开放后。（2）杭州城市重心经历了“北—西北—北—东南—南”的变化过程,由向单一方向扩张转变为多方向均衡发展的态势。（3）建设用地扩张过程基本符合“扩散—融合”假说;城市核心区呈现蛙跳增长、填充增长、边缘增长依次主导的螺旋式发展过程,研究区域整体表现为边缘增长始终占相对重要地位的特征。（4）通过近代地图与遥感影像的集成分析,为长时间尺度的城市研究提供了一种路径。     

高压干气密封扭转变形结构因素影响分析

基于圆环理论以及气体润滑理论,以复杂截面机械密封环为研究对象,建立密封扭转变形无量纲分析模型;提出了干气密封端面膜压引起端面扭转变形的计算方法,并基于该法,采用多因素优化法研究密封环结构和辅助密封圈安放位置等因素对其扭转变形的影响规律,以期使结构影响规律化.结果表明:采用解析法与集中法计算膜压扭转变形是可行的;各结构参数对扭转变形的影响规律及程度不同;扭转角随台阶半径比π2、长度比π3、O型圈位置的长度比π5的增大而增大,随宽度比π4、内径ri的增大而减少;扭转角在π4≤3.5时随长宽比π1的增大而减小,当π43.5时,随π1的增大先增大后减小,在π1=2~3间形成最大值;π1值相比π2值,对扭转角影响不大;相比π1、π2、π3和π4的影响,ri和π5影响较小,相比密封结构,O型圈位置影响较小.     

梯形箱梁剪力滞后效应的精细化分析

引入剪滞翘曲应力自平衡条件的影响,考虑了剪切变形和剪滞效应等因素,设置了三个不同的剪滞纵向位移差函数以准确反映梯形箱梁不同宽度翼板的剪滞变化幅度,提出了一种能对工程中常用箱梁静力学特性分析的精确解法。本文以能量变分原理为基础建立了薄壁箱梁的弹性控制微分方程和自然边界条件,获得了相应广义位移的闭合解。算例中,分析了不同荷载形式、跨宽比和悬臂板长度等因素对箱梁静力学特性的影响,结果显示出引入剪滞翘曲应力自平衡条件的必要性。     

一阶无穷小位移机构的刚化判定

一阶无穷小位移机构是一类具有机构性能的特殊的新型空间结构,从工程结构的角度考虑,只有能够清除机构性而获得几何刚度的体系才是可承载的结构体系。一阶无穷小位移机构的几何刚度的获得是通过体系的相对机构位移而获得的,这与传统结构的几何刚度的概念是完全不同的。因此,研究一阶无穷小位移机构的刚化问题是非常重要的。Maxwell准则只从体系的拓扑关系来考虑体系的几何稳定性,这显然不能应用于一阶无穷小位移机构的刚化判定问题。本文基于矩阵向量空间分解的理论和一阶无穷小位移机构的概念。在体系的平衡矩阵引入了边界条件,对一阶无穷小位移机构的刚化判定问题进行了分析,运用功能原理给出了一阶无穷小位移机构刚化的等价条件和判定方法。通过几个数值算例验证了本文结论和方法是正确的、可靠的。     

A Structured Family of Clustering and Tree Construction Methods

A cluster A is an Apresjan cluster if every pair of objects within A is more similar than either is to any object outside A. The criterion is intuitive, compelling, but often too restrictive for applications in classification. We therefore explore extensions of Apresjan clustering to a family of related hierarchical clustering methods. The extensions are shown to be closely connected with the well-known single and average linkage tree constructions. A dual family of methods for classification by splits is also presented. Splits are partitions of the set of objects into two disjoint blocks and are widely used in domains such as phylogenetics. Both the cluster and split methods give rise to progressively refined tree representations. We exploit dualities and connections between the various methods, giving polynomial time construction algorithms for most of the constructions and NP-hardness results for the rest.